منابع مشابه
Non determinism through type isomorphism
Several non-deterministic extensions to the λ -calculus have been proposed, e.g. [6, 7, 10–12, 24]. In these approaches, the parallel composition (sometimes called the must-convergent parallel composition) is such that if r and s are two λ -terms, the term r+ s (also written r ‖ s) represents the computation that runs either r or s non-deterministically. It is common to consider in these approa...
متن کاملNon-Interference Through Determinism
The standard approach to the specification of a secure system is to present a (usually state-hased) abstract security model separately from the specification of the system's functional n:quirements, and establishing a correspondence between the two specifications. This complex treatment has resulted in development methods distinct from those usually advocated for general applications. We provid...
متن کاملTiling-recognizable Two-dimensional Languages: from Non-determinism to Determinism through Unambiguity
Tiling recognizable two-dimensional languages, also known as REC, generalize recognizable string languages to two dimensions and share with them several theoretical properties. Nevertheless REC is not closed under complementation and the membership problem is NP-complete. This implies that this family REC is intrinsically non-deterministic. The natural and immediate definition of unambiguity co...
متن کاملRandomness and Non-determinism
Exponentiation makes the difference between the bit-size of this line and the number (≪ 2) of particles in the known Universe. The expulsion of exponential time algorithms from Computer Theory in the 60’s broke its umbilical cord from Mathematical Logic. It created a deep gap between deterministic computation and – formerly its unremarkable tools – randomness and non-determinism. Little did we ...
متن کاملSyntactic isomorphism and non-isomorphism under ellipsis
Rooth (1992) and Fiengo and May (1994) argue that elliptical structures are subject to both a semantic and a syntactic parallelism requirement. Pseudosluicing, where an elliptical cleft takes a non-cleft as its antecedent, pose a problem for the idea that there is a syntactic parallelism requirement. In this talk, we will look at Spanish data (building on the analysis of Rodrigues et al. 2008) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2013
ISSN: 2075-2180
DOI: 10.4204/eptcs.113.13